Structured Local Optima in Sparse Blind Deconvolution

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Blind Deconvolution with Sparse Priors on the Deconvolution Filters

In performing blind deconvolution to remove reverberation from speech signal, most acoustic deconvolution filters need a great many number of taps, and acoustic environments are often time-varying. Therefore, deconvolution filter coefficients should find their desired values with limited data, but conventional methods need lots of data to converge the coefficients. In this paper, we use sparse ...

متن کامل

Blind Deconvolution with Non-local Sparsity Reweighting

Blind deconvolution has made significant progress in the past decade. Most successful algorithms are classified either as Variational or Maximum a-Posteriori (MAP ). In spite of the superior theoretical justification of variational techniques, carefully constructed MAP algorithms have proven equally effective in practice. In this paper, we show that all successful MAP and variational algorithms...

متن کامل

Optimal Sparse Representations for Blind Deconvolution of Images

The relative Newton algorithm, previously proposed for quasi maximum likelihood blind source separation and blind deconvolution of one-dimensional signals is generalized for blind deconvolution of images. Smooth approximation of the absolute value is used in modelling the log probability density function, which is suitable for sparse sources. We propose a method of sparsification, which allows ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2020

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2019.2940657